Optimizing Route Length in Reactive Protocols for Ad Hoc Networks

نویسندگان

  • Thomas Heide Clausen
  • Laurent Viennot
چکیده

Many protocols for Mobile Ad-hoc Networks propose construction of routes reactively using flooding. The advantage hereof is that no prior assumption of the network topology is required in order to provide routing between any pair of nodes in the network. In mobile networks, where the topology may be subject to frequent changes, this is a particularly attractive property. In this paper, we investigate the effect of using flooding for acquiring routes. We show that flooding may lead to non-optimal routes in terms of number of hops. This implies that more retransmissions are needed to send a packet along a route. We proceed by providing a qualitative analysis of the route lengths. Finally, we propose alternative flooding schemes and evaluate these schemes through simulations. We find that using these schemes, it is indeed possible to provide shorter routes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Securing AODV routing protocol against the black hole attack using Firefly algorithm

Mobile ad hoc networks are networks composed of wireless devices to create a network with the ability for self-organization. These networks are designed as a new generation of computer networks to satisfy some specific requirements and with features different from wired networks. These networks have no fixed communication infrastructure and for communication with other nodes the intermediate no...

متن کامل

Evaluating Wireless Reactive Routing Protocols with Linear Programming Model for Wireless Ad-hoc Networks

In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NET works, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users...

متن کامل

Optimizing Route-Cache Lifetime in Ad Hoc Networks

On-demand routing reduces the control overhead in mobile ad hoc networks, but it has the major drawback of introducing latency between route-request arrival and the determination of a valid route. This paper addresses the issue of minimizing the delay in on-demand routing protocols through optimizing the Time-to-Live (TTL) interval for route caching. An analytical framework is introduced to com...

متن کامل

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002